Counting hexagonal lattice animals confined to a strip

We describe a bijection between hexagonal lattice animals and a special type of square lattice animals. Using this bijection we adopt Maple packages that automatically generates generating functions (and series expansions) for fixed square lattice lattice animals to that of fixed hexagonal animals on the two-dimensional hexagonal lattice confined to a strip 0 ≤ y ≤ k, for arbitrary k. In [Z1], Zeilberger used finite transfer matrix method and developed two Maple packages ANIMALS and FreeANIMALS to count square lattice animals confined to a strip. Here we define a bijection between hexagonal lattice animals and a special class of square lattice animals and adopt the packages HexANIMALS and HexaFreeANIMALS accompanying [Z1] to enumerate hexagonal lattice animals. Definition 1.1 A hexagonal lattice animal (hexagonal polyominoes hence forth) on the hexagonal lattice is an edge-connected set of lattice cells on the hexagonal lattice. Two animals are equivalent if they are translations of each other.